Decidability of Linear AÆne Logic
نویسنده
چکیده
Propositional linear logic is known to be undecidable. In the current paper we prove that full propositional linear aÆne logic containing all the multiplicatives, additives, exponentials, and constants is decidable. The proof is based on a reduction of linear aÆne logic to sequents of speci c \normal forms", and on a generalization of Kanovich computational interpretation of linear logic adapted to these \normal forms".
منابع مشابه
Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent’s knowledge in non-transitive temporal linear logic LTLPast,m. We find algorithms solving mentioned problems, justify our approach to consider linear non-transitive time with several examples. Main, most complicated, technical new result is it decidability of LTLPa...
متن کاملIntransitive Linear Temporal Logic, Knowledge from Past, Decidability, Admissible Rules
Our paper studies linear temporal (with UNTIL and NEXT) logic based at a conception of intransitive time. non-transitive time. In particular, we demonstrate how the notion of knowledge might be represented in such a framework (here we consider logical operation N and the operation until U (actually, the time overall) to be directed to past). The basic mathematical problems we study are the fund...
متن کاملNorihiro Kamide TEMPORAL NON - COMMUTATIVE LOGIC : Expressing time , resource , order and hierarchy
A first-order temporal non-commutative logic TN[l], which has no structural rules and has some l-bounded linear-time temporal operators, is introduced as a Gentzen-type sequent calculus. The logic TN[l] allows us to provide not only time-dependent, resource-sensitive, ordered, but also hierarchical reasoning. Decidability, cut-elimination and completeness (w.r.t. phase semantics) theorems are s...
متن کاملIdentification of Piecewise Affine Wiener Models via Mixed-Integer Programming
Many successful tools have been proposed by several researchers for safety analysis, stability analysis, and control/scheduling synthesis for hybrid systems. However, one important area which has not received much attention in the hybrid systems community is the identi cation of piecewise aÆne systems. As a step in that direction, we present an algorithm for identifying piecewise aÆne Wiener mo...
متن کاملCompleteness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly ordered sets of models of the underlying logic. This interpretation induces an entailment relation between sequence formulas which strongly depends on which orderings one wishes to consider. Some important classes are:...
متن کامل